Fast variable-size block motion estimation using merging procedure with an adaptive threshold

نویسندگان

  • Yu-Kuang Tu
  • Jar-Ferr Yang
  • Yi-Nung Shen
  • Ming-Ting Sun
چکیده

A merging procedure for variable-size block motion estimation is proposed to reduce the computation for block-size decision. A smaller block-size is initially used for motion estimation. An adaptive threshold, which depends on the information obtained from the motion estimation, quantization parameter, and rate distortion cost function is used to determine if the motion vectors of the neighboring blocks should be merged or not. We simulate the proposed merging procedure using an H.264 video encoder to determine if 16x16, 16x8, 8x16, or 8x8 blocksize should be used for each macroblock. Based on the simulations, performance of the proposed method is close to that of H.264 JM2.1 when 16x16, 16x8, 8x16 and 8x8 block modes are enabled and the exhaustive search method is used to determine the block-sizes. Computational complexity can be significantly reduced by the proposed algorithm since it only performs the motion search for one block-size.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Variable Size Block Motion Estimation Algorithm for H.264/AVC System

H.264/AVC standard provides a significant improvement in digital video compression but it requires more computation power. In this paper a fast variable size block motion estimation algorithm based on adaptive search is implemented to describe a mode of variable size block motion compensation. This algorithm will adaptively change the threshold value depending upon the variable block sizes and ...

متن کامل

Adaptive search area for fast motion estimation

In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...

متن کامل

Adaptive block matching motion compensation for low bit-rate video coding

Most predictive coding schemes for videoconferencing and multimedia employ block matching motion compensation. The algorithm is easily parallelised and thus readily implemented in VLSI using SIMD structures. The image frame is divided into a fixed number of square blocks, and for each block a search is conducted within a predefined window of an adjacent frame to find the best match. The accepta...

متن کامل

Fast Motion Estimation Techniques with Adaptive Variable Search Range

In this paper, we present two fast motion estimation techniques with adaptive variable search range using spatial and temporal correlation of moving pictures respectively. The first technique uses a frame difference between two adjacent frames which is used as a criterion for deciding search window size. The second one uses deviation between the past and the predicted current frame motion vecto...

متن کامل

FAST PREDICTIVE VARIABLE−BLOCK−SIZE MOTION ESTIMATION FOR H.264/AVC (FriAmOR4)

The emerging H.264 advanced video coding (H.264/AVC) standard achieves significant improvement in coding efficiency compared with previous standards such as MPEG−2 and H.263. One major contribution of its gain profits from variable−block−size motion estimation, which also leads to higher computational complexity. In this paper, we propose a fast predictive variable−block−size motion estimation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003